A “K Hypotheses + Other” Belief Updating Model
نویسندگان
چکیده
Spoken dialog systems typically rely on recognition confidence scores to guard against potential misunderstandings. While confidence scores can provide an initial assessment for the reliability of the information obtained from the user, ideally systems should leverage information that is available in subsequent user responses to update and improve the accuracy of their beliefs. We present a machine-learning based solution for this problem. We use a compressed representation of beliefs that tracks up to k hypotheses for each concept at any given time. We train a generalized linear model to perform the updates. Experimental results show that the proposed approach significantly outperforms heuristic rules used for this task in current systems. Furthermore, a user study with a mixed-initiative spoken dialog system shows that the approach leads to significant gains in task success and in the efficiency of the interaction, across a wide range of recognition error-rates.
منابع مشابه
Relevance-Based Incremental Belief Updating in Bayesian Networks
Relevance reasoning in Bayesian networks can be used to improve eeciency of belief updating algorithms by identifying and pruning those parts of a network that are irrelevant for the computation. Relevance reasoning is based on the graphical property of d{separation and other simple and eecient techniques, the computational complexity of which is usually negligible when compared to the complexi...
متن کاملProspective Updating of Theories with Preferences
This work focuses on updating and revising theories with preferences within the context of logic programming. This aim is achieved by first exploiting preferences to reduce the number of abductive extensions of the initial theory, then by using the observations to confirm or deny the abduced hypotheses. In case the observations disconfirm the preferred abduced hypotheses, a revision process is ...
متن کاملDistributed Revision of Belief Commitment in Multi-Hypothesis Interpretations
This paper extends the applications of belief-networks to include the revision of belief commitments, i.e., the categorical acceptance of a subset of hypotheses which, together, constitute the most satisfactory explanation of the evidence at hand. A coherent model of non-monotonic reasoning is established and distributed algorithms for belief revision are presented. We show that, in singly conn...
متن کاملParallel Belief Updating in Sequential Diagnostic Reasoning
In sequential diagnostic reasoning the goal is to determine the most likely cause for a number of sequentially observed effects. Potential hypotheses are narrowed down by integrating the cumulating observed evidence leading to the selection of one among several hypotheses. In the reported diagnostic reasoning experiment, thirty-eight participants were tested with quasi-medical problems consisti...
متن کاملFault-Tolerant Multi-Agent Exact Belief Propagation
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains, where agents (subdomains) are organized by a tree structure (called hypertree). In earlier work, all belief updating methods on a hypertree are made of two rounds of propagation, each of which is implemented as a recursive process. Both processes need to be started from ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006